On Bounded Distance Decoding for General Lattices

A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice L represented by some basis, and a target point y, nd the lattice point closest to y. Bounded Distance Decoding is a variant of this problem in which the target is guaranteed to be close to the lattice, relative to the minimum distance 1(L) of the lattice. Speci cally, in the -Bounded Distance Decoding problem ( BDD), we are given a lattice L and a vector y (within distance 1(L) from the lattice), and we are asked to nd a lattice point x 2 L within distance 1(L) from the target. In coding theory, the lattice points correspond to codewords, and the target points correspond to lattice points being perturbed by noise vectors. Since in coding theory the lattice is usually xed, we may \pre-process" it before receiving any targets, to make the subsequent decoding faster. This leads us to consider -BDD with pre-processing. We show how a recent technique of Aharonov and Regev [2] can be used to solve -BDD with pre-processing in polynomial time for = O p(logn)=n . This improves upon the previously best known algorithm due to Klein [13] which solved the problem for = O (1=n). We also establish hardness results for -BDD and -BDD with pre-processing, as well as generalize our results to other `p norms.